Directed Virtual Path Layouts in ATM Networks
نویسندگان
چکیده
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). For both general and particular networks, such as paths, cycles, meshes, tori and trees, we derive tight bounds on the virtual diameter (the maximum hop count for a connection) as a function of the network capacity (the maximum load of a physical link). Key-words: Graphs, ATM Networks, Virtual Path Layout, Diameter, Embedding, Load This work has been supported by the French-Israeli cooperation AFIRST I3S Université de Nice, SLOOP joint project CNRS-UNSA-INRIA, 2004 route des Lucioles, BP93, F-06902 Sophia-Antipolis, France. ([email protected]) y I3S Université de Nice, SLOOP joint project CNRS-UNSA-INRIA, 2004 route des Lucioles, BP93, F-06902 Sophia-Antipolis, France. ([email protected]) z Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel. ([email protected]) x I3S Université de Nice, SLOOP joint project CNRS-UNSA-INRIA, 2004 route des Lucioles, BP93, F-06902 Sophia-Antipolis, France. ([email protected]) Positionnement des Chemins Virtuels dans les Réseaux ATM Résumé : Comment construire sur un réseau physique orienté un réseau virtuel de topologie optimale au sens de diamètre et charge minimals ? Cette question est motivée par les problèmes de routage dans les réseaux ATM. Nous y répondons pour les réseaux de topologie classique tels que le cycle, le chemin, les grilles, les tores ou les arbres en construisant un ensemble de chemins virtuels (VPs) satisfaisant certaines contraintes de charge et de nombre de sauts. Nous donnons ainsi des bornes sur le diamètre du graphe virtuel en fonction de la capacité des liens physiques. Mots-clés : Graphes, Réseaux ATM, Virtual Path Layout, Diamètre, Plongement, Charge DVPL in ATM networks 3
منابع مشابه
Virtual Path Layouts with Low Congestion or Low Diameter in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). Fo...
متن کاملVirtual path layouts optimizing total hop count on ATM tree networks
This paper presents some algorithmic results concerning virtual path layouts for the one-to-many communication problem in ATM tree networks. The ATM network model is based on covering the network with a layout of virtual paths, under some constraints on the allowed load, namely, the number of paths that can share an edge. The quality measure used is the hop count, namely, the number of edges tr...
متن کاملDimensioning ATM Networks using 2-Layer Hierarchical Virtual Path Layouts
This paper addresses the problem of dimensioning multi-service ATM networks, where each service is supported by a different logical network. In the traditional approach, logical networks are configured with end-to-end VPCs, which greatly simplifies VCC admission control. This approach does not explore resource sharing gains since an end-to-end VPC bandwidth is assigned to each VCC flow. In this...
متن کاملVirtual Path Layouts in ATM Networks
We study virtual path layouts in a very popular type of fast interconnection networks, namely ATM networks. One of the main problems in such networks is to construct path layout that minimizes the hop-number (i.e. the number of virtual paths between any two nodes) as a function of edge congestion (i.e. the number of virtual paths going through a link). In this paper we construct for any n verte...
متن کاملLower Bounds for the Virtual Path Layout Problem in ATM Networks
In this paper we deal with the problem of designing virtual path layouts in ATM networks with given hop-count and minimum load, for which we prove a lower bound with respect to networks with arbitrary topology. The result is then applied to derive a tight lower bound for the one-to-many communication pattern in networks with arbitrary topology, and for the many-to-many communication pattern in ...
متن کامل